KiMPA: A Kinematics-Based Method for Polygon Approximation
نویسندگان
چکیده
In different types of information systems, such as multimedia information systems and geographic information systems, object-based information is represented via polygons corresponding to the boundaries of object regions. In many applications, the polygons have large number of vertices and edges, thus a way of representing the polygons with less number of vertices and edges is developed. This approach, called polygon approximation, or polygon simplification, is basically motivated with the difficulties faced in processing polygons with large number of vertices. Besides, large memory usage and disk requirements, and the possibility of having relatively more noise can also be considered as the reasons for polygon simplification. In this paper, a kinematics-based method for polygon approximation is proposed. The vertices of polygons are simplified according to the velocities and accelerations of the vertices with respect to the centroid of the polygon. Another property of the proposed method is that the user may set the number of vertices to be in the approximated polygon, and may hierarchically simplify the output. The approximation method is demonstrated through the experiments based on a set of polygonal objects.
منابع مشابه
An Analytical Solution for Inverse Determination of Residual Stress Field
An analytical solution is presented that reconstructs residual stress field from limited and incomplete data. The inverse problem of reconstructing residual stresses is solved using an appropriate form of the airy stress function. This function is chosen to satisfy the stress equilibrium equations together with the boundary conditions for a domain within a convex polygon. The analytical solu...
متن کاملThree dimensional static and dynamic analysis of thick plates by the meshless local Petrov-Galerkin (MLPG) method under different loading conditions
In this paper, three dimensional (3D) static and dynamic analysis of thick plates based on the Meshless Local Petrov-Galerkin (MLPG) is presented. Using the kinematics of a three-dimensional continuum, the local weak form of the equilibrium equations is derived. A weak formulation for the set of governing equations is transformed into local integral equations on local sub-domains by using a uni...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملParallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware
The paper presents a parallel algorithm for polygon approximation targeted at reconfigurable multi-ring hardware. The proposed algorithm grows the edges of polygon approximation that is based on principle of merging. The edge/s are grown simultaneously at point/s where the minimum merging error is produced. The merging process is made faster by carrying it out in two stages: i) During first sta...
متن کاملMesh-Based Inverse Kinematics
2 Feature Vectors 6 2.1 The deformation gradient . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Extending the triangle representation . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.3 Extracting Feature Vectors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.4 Reconstructing the Mesh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002